POSSIBLE WORLDS SEMANTICS AND THE LIAR Reflections on a Problem Posed by Kaplan

نویسنده

  • STEN LINDSTRÖM
چکیده

In this paper I discuss a paradox, due to David Kaplan, that in his view threatens the use of possible worlds semantics as a model-theoretic framework for intensional logic.1 Kaplan’s paradox starts out from an intuitively reasonable principle that I refer to as the Principle of Plenitude. From this principle he derives a contradiction in what he calls Naive Possible World Theory. Kaplan’s metatheoretic argument can be restated in the modal object language as an intensional version of the Liar paradox. To dissolve the paradox, Kaplan favors a ramified theory of propositions, along the lines of Russell’s ramified theory of types. According to this approach: (i) the propositions are divided into orders 0, 1,. . . ; (ii) a propositional quantifier never ranges over the totality of all propositions but only over the propositions of some given order; and (iii) a proposition that involves quantification over the propositions of a given order will itself be of higher order than the propositions in the domain of quantification. Accordingly, a sentence can never express a proposition that is itself within the range of one of the propositional quantifiers in the sentence. This approach avoids the intensional Liar paradox, but its implementation involves severe complications both in the syntax and in the model theory of intensional logic.2 Here I shall attempt an alternative, less drastic, modification of the standard possible worlds methodology than the one favored by Kaplan. The idea is to regard sentences that involve propositional quantifiers, like the sentence

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Russell-kaplan Paradox and Other Modal Paradoxes: a New Solution

The most successful semantics for modal logic in the narrow sense, the logic of possibility, necessity, impossibility and contingency, has been possible worlds semantics. And though various kinds of algebraic semantics (as in Bealer 1982) are emerging as noteworthy rivals to possible worlds semantics in the area of general intensional logic (such as the logic of propositional attitudes, etc.), ...

متن کامل

Analyzing the problem of meaning in Shabastari’s Golshane Raz

Man has always been finding a complete model for semantics since the beginning. A model which can as a paradigm affects all branches of sciences. In the view of author, such a model can be found in Golshane Raz. Introducing the model from the work mentioned, the paper has tried to explain its sub structural foundations in three fields of ontology, epistemology and semantics. Some of the foundat...

متن کامل

Multidimensional Possible-world Semantics for Conditionals

Adams’ Thesis the claim that the probabilities of indicative conditionals equal the conditional probabilities of their consequents given their antecedents – has proven impossible to accommodate within orthodox possible worlds semantics. This paper considers the approaches to the problem taken by Jeffrey and Stalnaker (1994) and by McGee (1989), but rejects them on the grounds that they imply a ...

متن کامل

On Epistemic Logic and Logical Omniscience

We consider the logical omniscience problem of epistemic logic. We argue that the problem is due to the way in which knowledge and belief are captured in Hintikka's possible worlds semantics. We describe an alternative approach in which propositions are sets of worlds, and knowledge and belief are simply a list of propositions for each agent. The problem of the circularity in the definition is ...

متن کامل

Preference Logic Programming: Optimization as Inference

Preference Logic Programming (PLP) is an extension of Constraint Logic Programming (CLP) for declaratively specifying optimization problems. In the PLP framework, the deenite clauses of a CLP program are augmented by two new kinds of clauses: optimization clauses and arbiter clauses. Optimization clauses specify which predicates are to be optimized and arbiter clauses specify the criteria to be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002